منابع مشابه
Spotting Colours
Spotting an object of a chosen colour, skin for example, in an image taken under uncontrolled lighting conditions requires some form of preprocessing to convert the image colours to an illumination-independent specification. Computational colour constancy algorithms are designed specifically to accomplish this task. We process images with different colour constancy algorithms and evaluate the r...
متن کاملColouring edges with many colours in cycles
The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define the generalized p-arboricity Arbp(G) of a graph G as the minimum number of colours needed to colour the edges of a multigraph G in such a way that every cycle C gets at least min(|C|, p + 1) colours. In the particular c...
متن کاملReconstructing hv-convex polyominoes with multiple colours
This thesis examines the problem of reconstructing multiple discrete 2D objects, represented by a set of cells arranged in an m×n grid, from their projections. The objects being constructed are disjoint, hv-convex polyominoes, each of which has a separate colour. The main results presented here are two algorithms for unordered C-colour reconstruction that have time complexities of O(Cnm) and O(...
متن کاملSwitching with more than two colours
The operation of switching a finite graph was introduced by Seidel, in the study of strongly regular graphs. We may conveniently regard a graph as being a 2-colouring of a complete graph; then the extension to switching of an m-coloured complete graph is easy to define. However, the situation is very different. For m > 2, all m-coloured graphs lie in the same switching class. However, there are...
متن کاملSampling Grid Colourings with Fewer Colours
We provide an optimally mixing Markov chain for 6-colourings of the square grid. Furthermore, this implies that the uniform distribution on the set of such colourings has strong spatial mixing. 4 and 5 are now the only remaining values of k for which it is not known whether there exists a rapidly mixing Markov chain for k-colourings of the square grid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society of Colour Material
سال: 2007
ISSN: 0010-180X
DOI: 10.4011/shikizai1937.80.420